Reasoning about Term Rewriting in Kleene Categories with Converse
نویسندگان
چکیده
This paper shows that “root-only” rewrite relations with respect to term rewriting systems can be expressed using Kleene star operations in a gs-monoidal Kleene category with converse. In our framework, we can analyze some properties of term rewriting systems by computing rewrite descendants of tree languages. As an application, we consider an infinite state model-checking problem given by a term rewriting system and an LTL formula.
منابع مشابه
Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse
We present a reorganisation of popular theories of “reasoning with relational flavour”, including allegories, Kleene algebras, and Dedekind categories, into an relatively symmetric picture using ordered categories as common base and defining converse independently from joins and meets. As an example application, we use this to regroup results about formalisation of algebraic graph rewriting and...
متن کاملKleene Algebra with Products and Iteration Theories
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs
متن کاملRewriting Context-free Families of String Diagrams
String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, which is the standard way of reasoning about the morphisms of monoidal categories, rewriting string diagrams results in shorter equational proofs, because the string diagrammatic representation allows us to formally establish...
متن کاملAlgebraic Notions of Termination
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, Löb’s formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are additively idempotent semirings with forward and backward modal operators. To model infinite behaviours, idempotent semirings are extended to divergence ...
متن کاملSome Experiments Using Term Rewriting Techniques for Concurrency
Theorem proving using term rewriting has been thoroughly explored for equational speciications; we look at the use of term rewriting for proving theorems in the process algebras of concurrency and conduct two experiments in this area. We use the LP theorem prover for proofs about CSP, and the RRL term rewriting system for reasoning about LOTOS. The results of these experiments provide informati...
متن کامل